Shortest path problem

Results: 829



#Item
51Abstract of “Sampling-based Randomized Algorithms for Big Data Analytics” by Matteo Riondato, Ph.D., Brown University, MayAnalyzing huge datasets becomes prohibitively slow when the dataset does not fit in mai

Abstract of “Sampling-based Randomized Algorithms for Big Data Analytics” by Matteo Riondato, Ph.D., Brown University, MayAnalyzing huge datasets becomes prohibitively slow when the dataset does not fit in mai

Add to Reading List

Source URL: matteo.rionda.to

Language: English - Date: 2016-07-30 12:22:15
52A 4-Geometry Maze Router and Its Application on Multiterminal Nets GENE EU JAN National Taipei University KI-YIN CHANG National Taiwan Ocean University

A 4-Geometry Maze Router and Its Application on Multiterminal Nets GENE EU JAN National Taipei University KI-YIN CHANG National Taiwan Ocean University

Add to Reading List

Source URL: www.ntpu.edu.tw

Language: English - Date: 2005-11-20 09:42:42
53Bachelor / Master Thesis  Shortest paths in disk coverings Description. Suppose you are travelling from town A to town B with a mobile communication device. To ensure you never lose connection, you decide to travel only

Bachelor / Master Thesis Shortest paths in disk coverings Description. Suppose you are travelling from town A to town B with a mobile communication device. To ensure you never lose connection, you decide to travel only

Add to Reading List

Source URL: page.math.tu-berlin.de

Language: English
54Inferring the Origin of Routing Changes using Link Weights Mohit Lad∗ , Ricardo Oliveira∗ , Dan Massey† , and Lixia Zhang∗ ∗ Computer  Science Department, University of California, Los Angeles CA 90095

Inferring the Origin of Routing Changes using Link Weights Mohit Lad∗ , Ricardo Oliveira∗ , Dan Massey† , and Lixia Zhang∗ ∗ Computer Science Department, University of California, Los Angeles CA 90095

Add to Reading List

Source URL: irl.cs.ucla.edu

Language: English
55Approximation and Collusion in Multicast Cost Sharing 1 Aaron Archer2 Cornell University, Operations Research Dept., Ithaca, NYE-mail:  and Joan Feigenbaum3 Arvind Krishnamurthy4 Rahul Sami

Approximation and Collusion in Multicast Cost Sharing 1 Aaron Archer2 Cornell University, Operations Research Dept., Ithaca, NYE-mail: and Joan Feigenbaum3 Arvind Krishnamurthy4 Rahul Sami

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2004-03-26 13:36:19
56Bounded Biharmonic Weights for Real-Time Deformation

Bounded Biharmonic Weights for Real-Time Deformation

Add to Reading List

Source URL: igl.ethz.ch

Language: English - Date: 2012-08-02 16:30:46
57Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar†

Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2005-11-30 21:17:11
58On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4

On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2014-04-14 14:04:38
59An Evolutionary Algorithm to Learn SPARQL Queries for Source-Target-Pairs Finding Patterns for Human Associations in DBpedia Jörn Hees, Rouven Bauer, Joachim Folz, Damian Borth, and Andreas Dengel 1

An Evolutionary Algorithm to Learn SPARQL Queries for Source-Target-Pairs Finding Patterns for Human Associations in DBpedia Jörn Hees, Rouven Bauer, Joachim Folz, Damian Borth, and Andreas Dengel 1

Add to Reading List

Source URL: joernhees.github.io

Language: English - Date: 2016-07-26 13:26:14
60Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion

Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:11